import random
import time
import numpy as np

def quicksort(arr):
    """
    快速排序算法实现
    """
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]  # 选择中间元素作为基准值
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quicksort(left) + middle + quicksort(right)


def test_quicksort():
    """
    测试快速排序算法
    """
    print("===== 快速排序测试 =====")
    
